A Kruskal-Katona type theorem for graphs
نویسنده
چکیده
A bound on consecutive clique numbers of graphs is established. This bound is evaluated and shown to often be much better than the bound of the Kruskal-Katona theorem. A bound on non-consecutive clique numbers is also proven.
منابع مشابه
Nonexistence of a Kruskal-Katona Type Theorem for Subword Orders
We consider the poset SO(n) of all words over an n{element alphabet ordered by the subword relation. It is known that SO(2) falls into the class of Macaulay posets, i.e. there is a theorem of Kruskal{Katona type for SO(2). As the corresponding linear ordering of the elements of SO(2) the vip{order can be chosen. Daykin introduced the V {order which generalizes the vip{order to the n 2 case. He ...
متن کاملShifting shadows: the Kruskal–Katona Theorem
As we have seen, antichains and intersecting families are fundamental to Extremal Set Theory. The two central theorems, Sperner’s Theorem and the Erdős–Ko–Rado Theorem, have inspired decades of research since their discovery, helping establish Extremal Set Theory as a vibrant and rapidly growing area of Discrete Mathematics. One must, then, pay a greater than usual amount of respect to the Krus...
متن کاملApproximations to the Kruskal-katona Theorem
Approximations to the Kruskal-Katona theorem are stated and proven. These approximations are weaker than the theorem, but much easier to work with numerically.
متن کاملLocal Structure: Subgraph Counts II
Proof. This theorem is a corollary of the (much more general) Kruskal-Katona theorem. The Kruskal-Katona theorem has a very hands-on proof, based on iteratively modifying the graph. We will see a linear-algebraic proof. Let A be the n×n adjacency matrix of G (Auv = 1 if vertex u is adjacent to vertex v, and Auv = 0 otherwise). Note that A is symmetric. It turns out that e and t are both fundame...
متن کاملKruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs
A forest is the clique complex of a strongly chordal graph and a quasiforest is the clique complex of a chordal graph. Kruskal–Katona type theorems for forests, quasi-forests, pure forests and pure quasi-forests will be presented. Introduction Recently, in commutative algebra, the forest ([5]) and the quasi-forest ([17] and [9]) have been extensively studied. Each of these concepts is, however,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 117 شماره
صفحات -
تاریخ انتشار 2010